Binary codes from $ m $-ary $ n $-cubes $ Q^m_n $

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical (m,n)−ary hypermodules over Krasner (m,n)−ary hyperrings

The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...

متن کامل

Augmented k-ary n-cubes

We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...

متن کامل

k-ary m-way Networks: the Dual of k-ary n-cubes

This article presents k-ary m-way networks, multidimensional mesh and tori networks that are viewed as the dual of k-ary n-cube networks. An m-way channel is the physical wiring of m router and processor links. An m-way router interfaces two channels only, irrespective of the network topology or dimension. This has important advantages: the same router can be used to build networks of different...

متن کامل

k-ary n-cubes versus Fat Trees

In this paper, we examine performance aspects of fat-tree topologies and compare these to k-ary ncube topologies. In particular, we apply the analytic techniques developed for cube topologies upon fat trees to understand better the characteristic of that topology. The organization of this paper is as follows: Section 1 contains an overview of k-ary n-cube and fat-tree topologies. Section 2 cont...

متن کامل

ON BOTTLENECK PARTITIONING k-ARY n-CUBES

/raph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a fimction of edges exposed by the partiti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2021

ISSN: 1930-5338

DOI: 10.3934/amc.2020079